Bounding the power of preemption in randomized schedulingCANETTI, R; IRANI, S.SIAM journal on computing (Print). 1998, Vol 27, Num 4, pp 993-1015, issn 0097-5397Article

Mesures de performances sur les calculateurs CRAY 1S et CDC CYBER 205 = Performances measurement on CRAY 1S and CDC CYBER 205 computersCHAUVET, Y; VERWAERDE, D.1984, 33 p.Report

Improved algorithms for group testing with inhibitorsDE BONIS, A; VACCARO, U.Information processing letters. 1998, Vol 67, Num 2, pp 57-64, issn 0020-0190Article

Minimizing the total completion time on-line on a single machine, using restartsVAN STEE, Rob; LA PCUTRE, Han.Journal of algorithms (Print). 2005, Vol 57, Num 2, pp 95-129, issn 0196-6774, 35 p.Article

Maximizing the area of overlap of two unions of disks under rigid motionDE BERG, Mark; CABELLO, Sergio; GIANNOPOULOS, Panos et al.Lecture notes in computer science. 2004, pp 138-149, issn 0302-9743, isbn 3-540-22339-8, 12 p.Conference Paper

Extending the accommodating functionBOYAR, Joan; FAVRHOLDT, Lene M; LARSEN, Kim S et al.Lecture notes in computer science. 2002, pp 87-96, issn 0302-9743, isbn 3-540-43996-X, 10 p.Conference Paper

Periodic graphs and connectivity of the rational digital hyperplanesGERARD, Yan.Theoretical computer science. 2002, Vol 283, Num 1, pp 171-182, issn 0304-3975Conference Paper

Improved derandomization of BPP using a hitting set generatorGOLDREICH, O; WIGDERSON, A.Lecture notes in computer science. 1999, pp 131-137, issn 0302-9743, isbn 3-540-66329-0Conference Paper

Efficient self-embedding of butterfly networks with random faultsTAMAKI, H.SIAM journal on computing (Print). 1998, Vol 27, Num 3, pp 614-636, issn 0097-5397Article

A survey of randomness and parallelism in comparison problemsKRIZANC, D.Lecture notes in computer science. 1998, pp 324-329, issn 0302-9743, isbn 3-540-64359-1Conference Paper

Randomized parallel prefetching and buffer managementVARMAN, P. J.Lecture notes in computer science. 1998, pp 363-372, issn 0302-9743, isbn 3-540-64359-1Conference Paper

A simple and efficient randomized byzantine agreement algorithmCHOR, B; COAN, B. A.IEEE transactions on software engineering. 1985, Vol 11, Num 6, pp 531-539, issn 0098-5589Article

Randomized online multi-threaded pagingSEIDEN, S. S.Lecture notes in computer science. 1998, pp 264-275, issn 0302-9743, isbn 3-540-64682-5Conference Paper

Capturing an Evader in a Building : Computational geometry in navigation and path planningSUZUKI, Ichiro; ZYLINSKI, Pawel.IEEE robotics & automation magazine. 2008, Vol 15, Num 2, pp 16-26, issn 1070-9932, 11 p.Article

Finding real-valued single-source shortest paths in o(n³) expected timeKOLLIOPOULOS, S. G; STEIN, C.Journal of algorithms (Print). 1998, Vol 28, Num 1, pp 125-141, issn 0196-6774Article

Efficient algorithms in zero-characteristic for a new model of representation of algebraic varietiesCHISTOV, Alexander L.Lecture notes in computer science. 2006, pp 137-146, issn 0302-9743, isbn 3-540-34166-8, 1Vol, 10 p.Conference Paper

Analysis of simple randomized buffer management for parallel I/OKALLAHALLA, Mahesh; VARMAN, Peter J.Information processing letters. 2004, Vol 90, Num 1, pp 47-52, issn 0020-0190, 6 p.Article

Bounding work and communication in robust cooperative computationCHLEBUS, Bogdan S; GASIENIEC, Leszek; KOWALSKI, Dariusz R et al.Lecture notes in computer science. 2002, pp 295-310, issn 0302-9743, isbn 3-540-00073-9, 16 p.Conference Paper

Using nondeterminism to design efficient deterministic algorithmsJIANER CHEN; FRIESEN, Donald K; WEIJIA JIA et al.Lecture notes in computer science. 2001, pp 120-131, issn 0302-9743, isbn 3-540-43002-4Conference Paper

Online scheduling with hard deadlinesGOLDMAN, S. A; PARWATIKAR, J; SURI, S et al.Journal of algorithms (Print). 2000, Vol 34, Num 2, pp 370-389, issn 0196-6774Article

Deterministic algorithms for 2-d convex programming and 3-d online linear programmingCHAN, T. M.Journal of algorithms (Print). 1998, Vol 27, Num 1, pp 147-166, issn 0196-6774Article

On randomized and deterministic schemes for routing and sorting on fixed-connection networksSUEL, T.Lecture notes in computer science. 1998, pp 384-386, issn 0302-9743, isbn 3-540-64359-1Conference Paper

Satisfiability : Algorithms and logicPUDLAK, P.Lecture notes in computer science. 1998, pp 129-141, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Practical Aurifeuillian factorizationALLOMBERT, Bill; BELABAS, Karim.Journal de théorie des nombres de Bordeaux. 2008, Vol 20, Num 3, pp 543-553, issn 1246-7405, 11 p.Article

Deterministic extractors for small-space sourcesKAMO, Jesse; RAO, Anup; VADHAN, Salil et al.Annual ACM symposium on theory of computing. 2006, pp 691-700, isbn 1-59593-134-1, 1Vol, 10 p.Conference Paper